3-Computer Science-System Analysis-Network-Boolean

Boolean network

Networks {Boolean network} can have nodes that are either on 1 or off 0. Inputs from other nodes determine node state. Boolean rules can make values 0 or 1 equally likely, make value 0 certain, make value 1 certain, or make any probability. If average Boolean rule makes value 0 or 1 almost certain, system is stable. If average value makes 0 and 1 equally likely, system is unstable. At one probability, system switches rapidly from order to chaos.

canalyzing

Boolean networks {canalyzing Boolean function} can have input that determines node output. For example, OR has two inputs and is canalyzing, because if either input is 1, output is 1. EXCLUSIVE OR is not canalyzing, because inputs depend on each other. If input number is two, 14 of 16 possible Boolean functions are canalyzing. EXCLUSIVE OR and IF AND ONLY IF are non-canalyzing. For Boolean functions with more than two inputs, few are canalyzing. Canalyzing functions have fewer interactions and so are simpler.

Related Topics in Table of Contents

3-Computer Science-System Analysis-Network

Drawings

Drawings

Contents and Indexes of Topics, Names, and Works

Outline of Knowledge Database Home Page

Contents

Glossary

Topic Index

Name Index

Works Index

Searching

Search Form

Database Information, Disclaimer, Privacy Statement, and Rights

Description of Outline of Knowledge Database

Notation

Disclaimer

Copyright Not Claimed

Privacy Statement

References and Bibliography

Consciousness Bibliography

Technical Information

Date Modified: 2022.0225